Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
نویسندگان
چکیده
منابع مشابه
Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
We present two algorithms for large-scale noisy low-rank Euclidean distance matrix completion problems, based on semidefinite optimization. Our first method works by relating cliques in the graph of the known distances to faces of the positive semidefinite cone, yielding a combinatorial procedure that is provably robust and partly parallelizable. Our second algorithm is a first order method for...
متن کاملThe Pareto Regret Frontier
Performance guarantees for online learning algorithms typically take the form of regret bounds, which express that the cumulative loss overhead compared to the best expert in hindsight is small. In the common case of large but structured expert sets we typically wish to keep the regret especially small compared to simple experts, at the cost of modest additional overhead compared to more comple...
متن کاملVisualizing the Pareto Frontier
We describe techniques for visualizing the Pareto optimal set that can be used if the multiobjective optimization problem considered has more than two objective functions. The techniques discussed can be applied in the framework of both MCDM and EMO approaches. First, lessons learned from methods developed for biobjective problems are considered. Then, visualization techniques for convex multio...
متن کاملDimensionality Reduction via Euclidean Distance Embeddings
This report provides a mathematically thorough review and investigation of Metric Multidimensional scaling (MDS) through the analysis of Euclidean distances in input and output spaces. By combining a geometric approach with modern linear algebra and multivariate analysis, Metric MDS is viewed as a Euclidean distance embedding transformation that converts between coordinate and coordinate-free r...
متن کاملDimensionality Reduction using Noisy Distance Data
The basic idea behind most dimensionality reduction algorithms is to find a low dimensional embedding of high dimensional data while roughly preserving the local relationships between the data points. The inputs to these algorithms are usually the point coordinates in the higher dimensional space or some form of mutual distance data between the points in the higher dimensional space. However, v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2017
ISSN: 1052-6234,1095-7189
DOI: 10.1137/15m103710x